A Multipurpose Backtracking Algorithm

نویسندگان
چکیده

منابع مشابه

A Multipurpose Backtracking Algorithm

A backtracking algorithm with element order selection is presented, and its efficiency discussed in relation both to standard examples and to examples concerning relation-preserving maps which the algorithm was derived to solve.

متن کامل

The message management asynchronous backtracking algorithm

This paper shows how the Asynchronous Backtracking (Yokoo et al., 1998) algorithm, a well known distributed constraint satisfaction algorithm, produces unnecessary messages and introduces our optimized algorithm, Message Management Asynchronous Backtracking, which reduces the number of messages the agents send. The message management mechanism removes the redundant messages, keeps message queue...

متن کامل

Idol-Guided Backtracking Search Optimization Algorithm

This paper introduces a new variant of the Backtracking Search Optimization Algorithm (BSA) in order to improve the quality of the solutions found by the algorithm. The proposed algorithm is called Idol-Guided Backtracking Search Optimization Algorithm (IG-BSA): it uses the historical population defined in BSA to build and update a set of idols taken from several previous generations, and the c...

متن کامل

Backtracking algorithm for lepton reconstruction with HADES

Events recorded in Au+Au collisions at a beam energy of 1.23 GeV/u have the highest multiplicities measured with HADES [1]. The track reconstruction and particle identification in the high track density environment are challenging. In case of dileptons: (i) A Ring Imaging Cherenkov detector (RICH) [2] is essential since it is the most important detector component for single lepton identificatio...

متن کامل

Simple ant routing algorithm strategies for a (Multipurpose) MANET model

A Mobile Ad-hoc Network has limited and scarce resources and thus routing protocols in such environments must be kept as simple as possible. The Simple Ant Routing Algorithm (SARA) offers a low overhead solution, by optimizing the routing process. Three complementary strategies were used in our approach: during the route discovery we have used a new broadcast mechanism, called the Controlled Ne...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Symbolic Computation

سال: 1994

ISSN: 0747-7171

DOI: 10.1006/jsco.1994.1035